Towards distributed processing of RDF path queries

نویسندگان

  • Heiner Stuckenschmidt
  • Richard Vdovjak
  • Jeen Broekstra
  • Geert-Jan Houben
چکیده

A technical infrastructure for storing, querying and managing RDF data is a key element in the current Semantic Web development. Systems like Jena, Sesame or the ICS-FORTH RDF Suite are widely used for building Semantic Web applications. Currently, none of these systems support the integrated querying of distributed RDF repositories. We consider this a major shortcoming since the Semantic Web is distributed by nature. In this paper we present an architecture for querying distributed RDF repositories by extending the existing Sesame system. We discuss the implications of our architecture and propose an index structure as well as algorithms for query processing and optimization in such a distributed

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Query Processing on Very Large RDF Graphs

Finding the shortest path between two nodes in an RDF graph is a fundamental operation that allows to discover complex relationships between entities. In this paper we consider the path queries over graphs from a database perspective. We provide the full-fledge database solution to execute path queries over very large RDF graphs. We present low-level techniques to speed-up shortest paths algori...

متن کامل

An Adaptive Framework for RDF Stream Processing

In this paper, we propose a novel framework for RDF stream processing named PRSP. Within this framework, the evaluation of C-SPARQL queries on RDF streams can be reduced to the evaluation of SPARQL queries on RDF graphs. We prove that the reduction is sound and complete. With PRSP, we implement several engines to support C-SPARQL queries by employing current SPARQL query engines such as Jena, g...

متن کامل

DIONYSUS: Towards Query-aware Distributed Processing of RDF Graph Streams

Arguably, the most significant obstacle to handle the emerging application’s data deluge is to design a system that addresses the challenges for big data’s volume, velocity and variety. Work in RDF stream processing (RSP) systems partly addresses the challenge of variety by promoting the RDF model. However, challenges like volume, velocity are overlooked by existing approaches. These challenges...

متن کامل

Continuous RDF Query Processing over DHTs

We study the continuous evaluation of conjunctive triple pattern queries over RDF data stored in distributed hash tables. In a continuous query scenario network nodes subscribe with long-standing queries and receive answers whenever RDF triples satisfying their queries are published. We present two novel query processing algorithms for this scenario and analyze their properties formally. Our pe...

متن کامل

D-SPARQ: Distributed, Scalable and Efficient RDF Query Engine

We present D-SPARQ, a distributed RDF query engine that combines the MapReduce processing framework with a NoSQL distributed data store, MongoDB. The performance of processing SPARQL queries mainly depends on the efficiency of handling the join operations between the RDF triple patterns. Our system features two unique characteristics that enable efficiently tackling this challenge: 1) Identifyi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Web Eng. Technol.

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2005